HOLA: Human-like Orthogonal Network Layout

Orthogonal Layout with Optimal Face Complexity

We study a problem motivated by rectilinear schematization of geographic maps. Given a biconnected plane graph G and an integer k ≥ 0, does G have a strictorthogonal drawing (i.e., an orthogonal drawing without edge bends) with at most k reflex angles per face? For k = 0, the problem is equivalent to realizing each face as a rectangle. We prove that the strict-orthogonal drawability problem for...

Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports

We present a fundamentally different approach to orthogonal layout of data flow diagrams with ports. This is based on extending constrained stress majorization to cater for ports and flow layout. Because we are minimizing stress we are able to better display global structure, as measured by several criteria such as stress, edge-length variance, and aspect ratio. Compared to the layered approach...

On the Approximability of Orthogonal Order Preserving Layout Adjustment

Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding box and preserves the orthogonal order i.e. maintains the sorted ordering of the rectangle centers along both x-axis and y-axis with respect to the initial placement. This problem is known as Layout Adjustment for Disjo...

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment

Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding box and preserves the orthogonal order i.e. maintains the sorted ordering of the rectangle centers along both x-axis and y-axis with respect to the initial placement. This problem is known as Layout Adjustment for Disjo...